Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs

This work studies the hardness of finding independent sets in hypergraphs which are either 2colorable or are almost 2-colorable, i.e. can be 2-colored after removing a small fraction of vertices and the incident hyperedges. To be precise, say that a hypergraph is (1−ε)-almost 2-colorable if removing an ε fraction of its vertices and all hyperedges incident on them makes the remaining hypergraph 2-colorable. In particular we prove the following results. • For an arbitrarily small constant γ > 0, there is a constant ξ > 0, such that, given a 4-uniform hypergraph on n vertices which is (1 − ε)-almost 2-colorable for ε = 2−(logn)ξ , it is quasi-NPhard1 to find an independent set of n /( 2 1−γ ) vertices. • For any constants ε, δ > 0, given as input a 3-uniform hypergraph on n vertices which is (1 − ε)almost 2-colorable, it is NP-hard to find an independent set of δn vertices. • Assuming the d-to-1 Games Conjecture the following holds. For any constant δ > 0, given a 2-colorable 3-uniform hypergraph on n vertices, it is NP-hard to find an independent set of δn vertices. The hardness result on independent set in almost 2-colorable 3-uniform hypergraphs was earlier known only assuming the Unique Games Conjecture. In this work we prove the result unconditionally, combining Fourier analytic techniques with the Multi-Layered PCP of [DGKR03]. For independent sets in 2-colorable 3-uniform hypergaphs we prove the first strong hardness result, albeit assuming the d-to-1 Games Conjecture. Our reduction uses the d-to-1 Game as a starting point to construct a Multi-Layered PCP with the smoothness property. We use analytical techniques based on the Invariance Principle of Mossel [Mos10]. The smoothness property is crucially exploited in a manner similar to recent work of Håstad [Hås12] and Wenner [Wen12]. Our result on almost 2-colorable 4-uniform hypergraphs gives the first nearly polynomial hardness factor for independent set in hypergraphs which are (almost) colorable with constantly many colors. It partially bridges the gap between the previous best lower bound of poly(logn) and the algorithmic upper bounds of n. This also exhibits a bottleneck to improving the algorithmic techniques for hypergraph coloring. Department of Computer Science, University of Chicago, USA. email: [email protected] IBM T. J. Watson Research Center, USA. email: [email protected] A problem is quasi-NP-hard if it admits a n n) time reduction from 3SAT.